Minimizing the volume in scheduling an out-tree with communication delays and duplication
نویسندگان
چکیده
We consider in this paper a scheduling problem given by n tasks of same processing time d, an out-tree, communication delays all equal to c d and an integer t. The problem is to nd the minimum volume of a feasible schedule with makespan t. Studying the dominance properties of such schedules, we prove that this problem is polynomial using a dynamic programming algorithm.
منابع مشابه
Tree Scheduling with Communication Delays
This paper considers the problem of scheduling a tree-structured task system in a distributed environment with the goal of minimizing the makespan. Interprocessor communication delays are taken into account and task duplication is allowed. Furthermore, it is assumed that the number of processors is unlimited. It is shown that there is a polynomial-time algorithm for an outtree and that the intr...
متن کاملDelay-Scheduled Controllers for Inter-Area Oscillations Considering Time Delays
Unlike the existing views that was introduced the existence of delay caused by the transmission of wide area measurement system data (WAMS) into the controllers input of the power oscilation damping (POD) by communication networks as a reason for poor performance of the POD controllers. This paper shows that the presence of time delay in the feedback loop may improve the performance of a POD co...
متن کاملTechnical Note: An opportunity cost maintenance scheduling framework for a fleet of ships: A case study
The conventional method towards deriving schedule for a fleet of ships to minimize cost alone has the short-coming of not addressing the problem of operation revenue losses associated with delays during maintenance at ships dockyards. In this paper, a preventive maintenance schedule for a fleet of ships that incorporates op-portunity cost is presented. The idea is to assign a penalty cost to al...
متن کاملUsing Duplication for Scheduling Unitary Tasks on m Processors with Unit Communication Delays
This paper introduces a new list scheduling algorithm that uses greedy duplication to solve a scheduling problem with communication delays and resource
متن کاملThe preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach
Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Computing
دوره 28 شماره
صفحات -
تاریخ انتشار 2002